Build, Augment and Destroy, Universally

نویسندگان

  • Neil Ghani
  • Tarmo Uustalu
  • Varmo Vene
چکیده

We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we give a semantics for inductive types based on limits of algebra structure forgetting functors and show that it is equivalent to the usual initial algebra semantics. We also give a similar semantic account of the augment generalization of build and of the unfold/destroy syntax of coinductive types.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 12th Delfino Problem and universally Baire sets of reals

We prove a theorem of Steel that solves the 12th Delfino Problem. We build on the one hand on a lemma of Woodin on universally Baire sets and their projections in certain generic extensions in the presence of strong cardinals; on the other hand we use certain premice to find projective uniformizations of projective sets.

متن کامل

Fekete-Szegö coefficient functional for transforms ‎of universally prestarlike functions

‎Universally prestarlike functions of order $alphaleq 1$ in the‎ ‎slit domain $Lambda=mathbb{C}setminus [1,infty)$ have been‎ ‎recently introduced by S‎. ‎Ruscheweyh.This notion generalizes the‎ ‎corresponding one for functions in the unit disk $Delta$ (and‎ ‎other circular domains in $mathbb{C}$)‎. ‎In this paper‎, ‎we obtain‎ ‎the Fekete-Szegö coefficient functional for transforms of such‎ ‎f...

متن کامل

Proving Correctness via Free Theorems

Free theorems feature prominently in the field of program transformation for pure functional languages such as Haskell. However, somewhat disappointingly, the semantic properties of so based transformations are often established only very superficially. This paper is intended as a case study showing how to use the existing theoretical foundations and formal methods for improving the situation. ...

متن کامل

When does noise destroy or enhance synchronous behavior in two mutually coupled light-controlled oscillators?

We study the influence of white gaussian noise in a system of two mutually coupled light-controlled oscillators (LCOs). We show that under certain noise intensity conditions, noise can destroy or enhance synchronization. We build some Arnold tonguelike structures in order to explain the effects due to noise. It is remarkable that noise-enhanced synchronization is possible only when the variance...

متن کامل

Chapter 1 Generalizing the AUGMENT Combinator

The usual initial algebra semantics of inductive types provides a clear and uniform explanation for the FOLD combinator. In an APLAS 2004 paper [1], we described an alternative equivalent semantics of inductive types as limits of algebra structure forgetting functors. This gave us an elegant universal property based account of the BUILD and AUGMENT combinators, which form the core of the shortc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004